Memoized Pull-Tabbing for Functional Logic Programming

Pull-tabbing is an evaluation technique for functional logic programs which computes all non-deterministic results in a single graph structure. Pull-tab steps are local transformations to move choices towards the root of expression. independent search strategy so that different strategies (depth-first, breadth-first, parallel) can be used extract computation. It has been compile languages into imperative or purely target languages. might duplicate case shared subexpressions. This could result dramatic increase execution time compared backtracking implementation. In this paper we propose refinement avoids efficiency problem while keeping good properties pull-tabbing. We evaluate first implementation improved Julia programming language.